Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
نویسندگان
چکیده
Recently Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Rectangle Bin Packing without rotations allowed, unless P = NP. We show that similar approximation hardness results hold for several rectangle packing problems even if rotations by ninety degrees around the axes are allowed. Moreover, for some of these problems we provide explicit lower bounds on asymptotic approximation ratio of any polynomial time approximation algorithm.
منابع مشابه
Hardness of approximation for orthogonal rectangle packing and covering problems
Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Bin Packing (without rotations), unless P = NP. We show that similar approximation hardness results hold for several 2and 3-dimensional rectangle packing and covering problems even if rotations by ninety degrees are allowed. Moreover, for some of these problems we provide explicit lower bounds on asym...
متن کاملHardness of asymptotic approximation for orthogonal rectangle packing and covering problems
Recently Bansal and Sviridenko [4] proved that for 2-dimensional Orthogonal Rectangle Bin Packing without rotations allowed there is no asymptotic PTAS, unless P = NP. We show that similar approximation hardness results hold for several rectangle packing and covering problems even if rotations by ninety degrees around the axes are allowed. Moreover, for some of these problems we provide explici...
متن کاملOn Approximating Four Covering/Packing Problems With Applications to Bioinformatics
In this paper, we consider approximability of four covering/packing type problems which have important applications in computational biology. The problems considered in this paper are the triangle packing problem, the full sibling reconstruction problem under two parsimonious assumptions, the maximum profit coverage problem and the 2-coverage problem. We provide approximation algorithms and ina...
متن کاملOn Continuity Properties for Infinite Rectangle Packing
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems, and discuss how they might be used to obtain negative results for perfect rectangle packing problems.
متن کاملNew Approximability Results for 2-Dimensional Packing Problems
The strip packing problem is to pack a set of rectangles into a strip of fixed width and minimum length. We present asymptotic polynomial time approximation schemes for this problem without and with 90o rotations. The additive constant in the approximation ratios of both algorithms is 1, improving on the additive term in the approximation ratios of the algorithm by Kenyon and Rémila (for the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006